Dedekind sums : a combinatorial - geometric viewpoint Matthias Beck and Sinai Robins
نویسنده
چکیده
The literature on Dedekind sums is vast. In this expository paper we show that there is a common thread to many generalizations of Dedekind sums, namely through the study of lattice point enumeration of rational poly-topes. In particular, there are some natural finite Fourier series which we call Fourier-Dedekind sums, and which form the building blocks of the number of partitions of an integer from a finite set of positive integers. This problem also goes by the name of the 'coin exchange problem'. Dedekind sums have enjoyed a resurgence of interest recently, from such diverse fields as topol-ogy, number theory, and combinatorial geometry. The Fourier-Dedekind sums we study here include as special cases generalized Dedekind sums studied by Berndt, Carlitz, Grosswald, Knuth, Rademacher, and Zagier. Our interest in these sums stems from the appearance of Dedekind's and Zagier's sums in lattice point count formulas for polytopes. Using some simple generating functions , we show that generalized Dedekind sums are natural ingredients for such formulas. As immediate 'geometric' corollaries to our formulas, we obtain and generalize reciprocity laws of Dedekind, Zagier, and Gessel. Finally, we prove a polynomial-time complexity result for Zagier's higher-dimensional Dedekind sums.
منابع مشابه
Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind - Rademacher Sums
We give explicit, polynomial–time computable formulas for the number of integer points in any two– dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of our formulas are Dedekind–Rademacher sums, which are polynomial–time computable finite Fourier series. As a by–product we rederive a reciprocity law for these...
متن کاملN ov 2 00 1 Explicit and efficient formulas for the lattice point count in rational polygons using Dedekind – Rademacher sums
We give explicit, polynomial–time computable formulas for the number of integer points in any two– dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of our formulas are Dedekind–Rademacher sums, which are polynomial–time computable finite Fourier series. As a by–product we rederive a reciprocity law for these...
متن کاملHIGHER-DIMENSIONAL DEDEKIND SUMS AND THEIR BOUNDS ARISING FROM THE DISCRETE DIAGONAL OF THE n-CUBE
We define a combinatorial game in R from which we derive numerous new inequalities between higher-dimensional Dedekind sums. Our approach is motivated by a recent article by Dilcher and Girstmair, who gave a nice probabilistic interpretation for the classical Dedekind sum. Here we introduce a game analogous to Dilcher and Girstmair’s model in higher dimensions.
متن کاملThe Reciprocity Law for Dedekind Sums via the constant Ehrhart coefficient
These sums appear in various branches of mathematics: Number Theory, Algebraic Geometry, and Topology; they have consequently been studied extensively in various contexts. These include the quadratic reciprocity law ([13]), random number generators ([12]), group actions on complex manifolds ([9]), and lattice point problems ([14], [5]). Dedekind was the first to show the following reciprocity l...
متن کامل